A note on strongly multiplicative graphs

On strongly 2-multiplicative graphs

In this paper we obtain an upper bound and also a lower bound for maximum edges of strongly 2 multiplicative graphs of order n. Also we prove that triangular ladder the graph obtained by duplication of an arbitrary edge by a new vertex in path and the graphobtained by duplicating all vertices by new edges in a path and some other graphs are strongly 2 multiplicative

A Note on Strongly Quotient Graphs

On multiplicative Zagreb indices of graphs

Todeschini et al. have recently suggested to consider multiplicative variants of additive graph invariants, which applied to the Zagreb indices would lead to the multiplicative Zagreb indices of a graph G, denoted by ( ) 1  G and ( ) 2  G , under the name first and second multiplicative Zagreb index, respectively. These are define as     ( ) 2 1 ( ) ( ) v V G G G d v and ( ) ( ) ( ) ( ) 2...

Sharp Upper bounds for Multiplicative Version of Degree Distance and Multiplicative Version of Gutman Index of Some Products of Graphs

In $1994,$ degree distance  of a graph was introduced by Dobrynin, Kochetova and Gutman. And Gutman proposed the Gutman index of a graph in $1994.$ In this paper, we introduce the concepts of  multiplicative version of degree distance and the multiplicative version of Gutman index of a graph. We find the sharp upper bound for the  multiplicative version of degree distance and multiplicative ver...

Note on Properties of First Zagreb Index of Graphs

Let G be a graph. The first Zagreb M1(G) of graph G is defined as: M1(G) = uV(G) deg(u)2. In this paper, we prove that each even number except 4 and 8 is a first Zagreb index of a caterpillar. Also, we show that the fist Zagreb index cannot be an odd number. Moreover, we obtain the fist Zagreb index of some graph operations.